package LeetCode;

public class LC110 {
    public boolean isBalanced(TreeNode root) {
        if(root==null) return true;
        return isBalanced(root.left)&&isBalanced(root.right)&&Math.abs(depth(root.left)-depth(root.right))<=1;
    }
    public int depth(TreeNode root){
        if(root==null ) return 0;
        return Math.max(depth(root.left),depth(root.right))+1;
    }
}
